The shape of supertrees to come: tree shape related properties of fourteen supertree methods.

نویسندگان

  • Mark Wilkinson
  • James A Cotton
  • Chris Creevey
  • Oliver Eulenstein
  • Simon R Harris
  • Francois-Joseph Lapointe
  • Claudine Levasseur
  • James O McInerney
  • Davide Pisani
  • Joseph L Thorley
چکیده

Using a simple example and simulations, we explore the impact of input tree shape upon a broad range of supertree methods. We find that input tree shape can affect how conflict is resolved by several supertree methods and that input tree shape effects may be substantial. Standard and irreversible matrix representation with parsimony (MRP), MinFlip, duplication-only Gene Tree Parsimony (GTP), and an implementation of the average consensus method have a tendency to resolve conflict in favor of relationships in unbalanced trees. Purvis MRP and the average dendrogram method appear to have an opposite tendency. Biases with respect to tree shape are correlated with objective functions that are based upon unusual asymmetric tree-to-tree distance or fit measures. Split, quartet, and triplet fit, most similar supertree, and MinCut methods (provided the latter are interpreted as Adams consensus-like supertrees) are not revealed to have any bias with respect to tree shape by our example, but whether this holds more generally is an open problem. Future development and evaluation of supertree methods should consider explicitly the undesirable biases and other properties that we highlight. In the meantime, use of a single, arbitrarily chosen supertree method is discouraged. Use of multiple methods and/or weighting schemes may allow practical assessment of the extent to which inferences from real data depend upon methodological biases with respect to input tree shape or size.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Running head: PROPERTIES OF MAJORITY-RULE SUPERTREES Properties of Majority-Rule Supertrees

2 Supertree methods assemble many smaller phylogenetic trees, called input trees, into a larger phylogenetic tree, a supertree, whose taxon set is the union of the taxon sets of the input trees. This synthesis can provide a high-level perspective that is harder to attain from individual trees. A recent example of the use of this approach is the species-level phylogeny of nearly all extant Mamma...

متن کامل

Properties of majority-rule supertrees.

Supertree methods assemble many smaller phyloge-netic trees, called input trees, into a larger phylogenetic tree, a supertree, whose taxon set is the union of the taxon sets of the input trees. This synthesis can provide a high-level perspective that is harder to attain from individual trees. A recent example of the use of this approach is the species-level phylogeny of nearly all extant Mammal...

متن کامل

Implementing and testing Bayesian and maximum-likelihood supertree methods in phylogenetics

Since their advent, supertrees have been increasingly used in large-scale evolutionary studies requiring a phylogenetic framework and substantial efforts have been devoted to developing a wide variety of supertree methods (SMs). Recent advances in supertree theory have allowed the implementation of maximum likelihood (ML) and Bayesian SMs, based on using an exponential distribution to model inc...

متن کامل

Submitted 05.09.03 PERFORMANCE OF FLIP-SUPERTREE HEURISTIC Performance of Flip-Supertree Construction with a Heuristic Algorithm

Supertree methods assemble separate phylogenetic trees with shared taxa into larger trees, or supertrees, in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes, or "flips"...

متن کامل

Polynomial Supertree Methods Revisited

Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one, more comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP), produces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper, we present an extensive simulation study c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Systematic biology

دوره 54 3  شماره 

صفحات  -

تاریخ انتشار 2005